PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN RUTE TERPENDEK STASIUN GUBENG MENUJU WISATA SURABAYA
نویسندگان
چکیده
Persoalan penentuan rute terpendek sudah menjadi hal umum untuk dibahas berkaitan dengan cara penyelesaiannya yang menggunakan graf. Penyelesaian tersebut umumnya digunakan tujuan mengoptimalisasi aspek tertentu, contohnya dalam penggunaan bahan bakar dan waktu tempuh. dapat diraih penerapan salah satu komponen graf yaitu algoritma. Jurnal ini ditulis guna membantu masyarakat terlebih para turis memberikan informasi terkait paling efisien dari titik awal stasiun menuju ke berbagai destinasi wisata kota Surabaya Algoritma Dijkstra Floyd-Warshall. Teknik perhitungan dilaksanakan secara manual bantuan program Bahasa C. Melalui penelitian tersebut, hasil diperoleh memiliki efisiensi lebih tinggi segi kompleksitas programnya. Perhitungan pada kedua algoritma menunjukkan berupa nilai bobot minimum sama tepat, adapun juga lintasan diterapkan meningkatkan berwisata di Surabaya. Untuk perbandingan dua adalah perjalanan Stasiun Gubeng Jalan Taman Apsari jarak tempuh sejauh 1,2 km.
منابع مشابه
The Floyd-Warshall Algorithm for Shortest Paths
The Floyd-Warshall algorithm [Flo62, Roy59, War62] is a classic dynamic programming algorithm to compute the length of all shortest paths between any two vertices in a graph (i.e. to solve the all-pairs shortest path problem, or APSP for short). Given a representation of the graph as a matrix of weights M , it computes another matrix M ′ which represents a graph with the same path lengths and c...
متن کاملEnriched Categories and the Floyd-warshall Connection
We give a correspondence between enriched categories and the Gauss-Kleene-Floyd-Warshall connection familiar to computer scientists. This correspondence shows this generalization of categories to be a close cousin to the generalization of transitive closure algorithms. Via this connection we may bring categorical and 2-categorical constructions into an active but algebraically impoverished aren...
متن کاملTransitive closure according to Roy-Floyd-Warshall
This formulation of the Roy-Floyd-Warshall algorithm for the transitive closure bypasses matrices and arrays, but uses a more direct mathematical model with adjacency functions for immediate predecessors and successors. This can be implemented efficiently in functional programming languages and is particularly adequate for sparse relations.
متن کاملOn the Floyd-Warshall Algorithm for Logic Programs
We explore the possibility of evaluating single-rule Datalog programs eeciently and with logarithmic work space by a natural extension of the Floyd-Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated: they are rather modest generalizations of the transitive closure. The proof relies on an interesting language-theoretic conce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JIKA (Jurnal Informatika)
سال: 2022
ISSN: ['2549-0710', '2722-2713']
DOI: https://doi.org/10.31000/jika.v6i3.6528